Algorithms. 41. FOURIER. Computation of Fourier-transform integrals

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On semifast Fourier transform algorithms

Abstract In this paper, following [1, 2, 3, 4, 5, 6, 7] we consider the relations between well-known Fourier transform algorithms.

متن کامل

Rapid Computation of the Discrete Fourier Transform

Algorithms for the rapid computation of the forward and inverse discrete Fourier transform for points which are nonequispaced or whose number is unrestricted are presented. The computational procedure is based on approximation using a local Taylor series expansion and the fast Fourier transform (FFT). The forward transform for nonequispaced points is computed as the solution of a linear system ...

متن کامل

Digital computation of the fractional Fourier transform

An algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with time-bandwidth product N , the presented algorithm computes the fractional transform in O( N log N ) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.

متن کامل

Semiclassical Fourier transform for quantum computation.

Shor’s algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a “classical” (macroscopic) signal resulting from the measurement of one bit (embodied in a twostate quantum system) is employed to determine the type of measuremen...

متن کامل

Quantum Algorithms and the Fourier Transform

The quantum algorithms of Deutsch, Simon and Shor are described in a way which highlights their dependence on the Fourier transform. The general construction of the Fourier transform on an Abelian group is outlined and this provides a unified way of understanding the efficacy of the algorithms. Finally we describe an efficient quantum factoring algorithm based on a general formalism of Kitaev a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applications of Mathematics

سال: 1976

ISSN: 0862-7940,1572-9109

DOI: 10.21136/am.1976.103641